Gauss’s ternary form reduction and the $2$-Sylow subgroup
نویسندگان
چکیده
منابع مشابه
A REDUCTION THEOREM FOR UNil OF FINITE GROUPS WITH NORMAL ABELIAN SYLOW 2-SUBGROUP
Let F be a finite group with a Sylow 2-subgroup S that is normal and abelian. Using hyperelementary induction and cartesian squares, we prove that Cappell’s unitary nilpotent groups UNil∗(Z[F ];Z[F ],Z[F ]) have an induced isomorphism to the quotient of UNil∗(Z[S];Z[S],Z[S]) by the action of the group F/S. In particular, any finite group F of odd order has the same UNil-groups as the trivial gr...
متن کاملReduction of UNil for finite groups with normal abelian Sylow 2-subgroup
Let F be a finite group with a Sylow 2-subgroup S that is normal and abelian. Using hyperelementary induction and cartesian squares, we prove that Cappell’s unitary nilpotent groups UNil∗(Z[F ];Z[F ],Z[F ]) have an induced isomorphism to the quotient of UNil∗(Z[S];Z[S],Z[S]) by the action of the group F/S. In particular, any finite group F of odd order has the same UNil-groups as the trivial gr...
متن کاملHalving for the 2-Sylow subgroup of genus 2 curves over binary fields
Article history: Received 12 December 2007 Available online 16 June 2009 Communicated by James W. P. Hirschfeld
متن کاملThe Cohomology of the Sylow 2-subgroup of the Higman-sims Group
Recently there has been substantial progress towards computing the mod 2 cohomology of low rank sporadic simple groups. In fact the mod 2 cohomology of every sporadic simple group not containing (Z/2) has been computed, with the notable exceptions of HS (the Higman–Sims group) and Co3 (one of the Conway groups). The reason for these exceptions is that these two groups have large and complicated...
متن کاملDetermining the 2-Sylow subgroup of an elliptic curve over a finite field
In this paper we describe an algorithm that outputs the order and the structure, including generators, of the 2-Sylow subgroup of an elliptic curve over a finite field. To do this, we do not assume any knowledge of the group order. The results that lead to the design of this algorithm are of inductive type. Then a right choice of points allows us to reach the end within a linear number of succe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1971
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1971-0297737-4